A Precise Deenition of Reduction

نویسنده

  • Renat Z. Zhdanov
چکیده

We give a comprehensive analysis of interrelations between the basic concepts of the modern theory of symmetry (classical and non-classical) reductions of partial diierential equations. Using the introduced deenition of reduction of diierential equations we establish equivalence of the non-classical (conditional symmetry) and direct (Ansatz) approaches to reduction of partial differential equations. As an illustration we give an example of non-classical reduction of the nonlinear wave equation in 1+3 dimensions. The conditional symmetry approach when applied to the equation in question yields a number of non-Lie reductions which are far-reaching generalization of the well-known symmetry reductions of the nonlinear wave equations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bias: Preference, Restriction or Core of Induction

In this paper, we aim to give a more precise deenition of bias in order to clarify diierent views. Since this deenition involves the problem setting of inductive learning, we have to take into account this deenition as well. A more precise deenition of the bias can be used to declare, to adapt and to shift the bias of an inductive system. We demonstrate these advantages by declaring and shiftin...

متن کامل

Under consideration for publication in J . Functional Programming 1 Container Types

A program derivation is said to be polytypic if some of its parameters are data types. Often these data types are container types, whose elements store data. Polytypic program derivations necessitate a general, non-inductive deenition of`container (data) type'. Here we propose such a deenition: a container type is a relator that has membership. It is shown how this deenition implies various oth...

متن کامل

Generalized Reversible Rules

A generalized notion of reversible rules is presented in this paper to perform state reduction in automatic formal veriication. The key idea is that some of the transition rules in a design may be invertible, and therefore, they can be used to collapse subgraphs into abstract states, thereby reducing the state explosion problem. This paper improves upon previous work to achieve the following go...

متن کامل

An Anytime Protocol for Speech Parsing

This paper presents a protocol that allows for the easy implementation of \anytime algorithms". After giving a more precise deenition of what an anytime algorithm is, we shortly discuss how anytime algorithms can be applied to parsing algorithms with feature uniication.

متن کامل

To a Mathematical Definition of \life"

\Life" and its \evolution" are fundamental concepts that have not yet been formulated in precise mathematical terms, although some eeorts in this direction have been made. We suggest a possible point of departure for a mathematical deenition of \life." This deenition is based on the computer and is closely related to recent analyses of \inductive inference" and \randomness." A living being is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999